Easy2Siksha.com
GNDU QUESTION PAPERS 2021
Bachelor of Computer Applicaon (BCA) 2nd Semester
(Batch 2023-26) (CBGS)
PRINCIPLES OF DIGITAL ELECTRONICS
Time Allowed: 3 Hours Maximum Marks: 75
Note: Aempt Five quesons in all, selecng at least One queson from each secon. The
Fih queson may be aempted from any secon. All quesons carry equal marks.
1. Perform the following number conversions:
Binary
Octal
Decimal
Hexadecimal
11001001
?
?
?
?
173
?
?
?
?
17.25
?
?
?
?
E17
2.(a) Explain the importance of 2’s Complement scheme. Discuss giving an example.
(b) How negave numbers stored in the computer and why? Explain.
(c) Explain ASCII codes.
3.What is NAND gate? Why it is called universal gate? Explain the concept with examples.
4.What is K-map? How it is helpful in solving Boolean expressions? Discuss in detail using
suitable example.
5.What is the need of a Decoder? Make a 3-8 Decoder using two 2-4 Decoders.
Easy2Siksha.com
6.(a) What is a combinaonal circuit? Make a 4-bit adder-subtracter circuit.
(b) What is the limitaon of J-K ip op? How is it solved? Explain.
(c) Draw and explain the structure of a 4-bit binary counter with increment input.
7.What is ROM? Explain dierent types of ROM memory in detail.
8.What is Address Selecon Logic? Explain the Address Selecon Logic in Random Access
Memory in detail using a suitable example.
Easy2Siksha.com
GNDU ANSWER PAPERS 2021
Bachelor of Computer Applicaon (BCA) 2nd Semester
(Batch 2023-26) (CBGS)
PRINCIPLES OF DIGITAL ELECTRONICS
Time Allowed: 3 Hours Maximum Marks: 75
Note: Aempt Five quesons in all, selecng at least One queson from each secon. The
Fih queson may be aempted from any secon. All quesons carry equal marks.
1. Perform the following number conversions:
Binary
Octal
Decimal
Hexadecimal
11001001
?
?
?
?
173
?
?
?
?
17.25
?
?
?
?
E17
Ans: Understanding the Question First
You are given numbers in different number systems:
• Binary (Base 2) → uses only 0 and 1
• Octal (Base 8) → digits from 0–7
• Decimal (Base 10) → normal numbers (0–9)
• Hexadecimal (Base 16) → digits 0–9 and letters A–F
Your task is to convert each number into all other systems.
Think of it like translating the same sentence into different languages — the meaning stays
the same, only the representation changes.
1. Convert: Binary → Others
Easy2Siksha.com
Given: 11001001 (Binary)
Step 1: Binary → Decimal
Each digit represents a power of 2:
1×2⁷ + 1×2⁶ + 0×2⁵ + 0×2⁴ + 1×2³ + 0×2² + 0×2¹ + 1×2⁰
= 128 + 64 + 0 + 0 + 8 + 0 + 0 + 1
= 201
Decimal = 201
Step 2: Decimal → Octal
Divide 201 by 8:
201 ÷ 8 = 25 remainder 1
25 ÷ 8 = 3 remainder 1
3 ÷ 8 = 0 remainder 3
Octal = 311
Step 3: Decimal → Hexadecimal
Divide by 16:
201 ÷ 16 = 12 remainder 9
12 = C
Hex = C9
✔ Final Answer:
Binary
Octal
Decimal
Hex
11001001
311
201
C9
2. Convert: Octal → Others
Given: 173 (Octal)
Easy2Siksha.com
Step 1: Octal → Decimal
1×8² + 7×8¹ + 3×8⁰
= 64 + 56 + 3
= 123
Decimal = 123
Step 2: Decimal → Binary
Divide by 2:
123 → 1111011
Binary = 1111011
Step 3: Decimal → Hex
123 ÷ 16 = 7 remainder 11
11 = B
Hex = 7B
✔ Final Answer:
Binary
Octal
Decimal
Hex
1111011
173
123
7B
3. Convert: Decimal → Others
Given: 17.25 (Decimal)
This one is interesting because it has a fraction (.25).
Step 1: Integer Part (17 → Binary)
17 ÷ 2 → 10001
Easy2Siksha.com
Step 2: Fraction Part (0.25 → Binary)
Multiply by 2:
0.25 × 2 = 0.5 → 0
0.5 × 2 = 1.0 → 1
Fraction = .01
Binary = 10001.01
Step 3: Decimal → Octal
Integer (17):
17 ÷ 8 = 2 remainder 1 → 21
Fraction:
0.25 × 8 = 2.0 → .2
Octal = 21.2
Step 4: Decimal → Hex
Integer:
17 = 11 (Hex)
Fraction:
0.25 × 16 = 4.0 → .4
Hex = 11.4
✔ Final Answer:
Binary
Octal
Decimal
Hex
10001.01
21.2
17.25
11.4
Easy2Siksha.com
4. Convert: Hex → Others
Given: E17 (Hex)
Remember:
• E = 14
Step 1: Hex → Decimal
E17 = 14×16² + 1×16¹ + 7×16⁰
= 14×256 + 16 + 7
= 3584 + 16 + 7
= 3607
Decimal = 3607
Step 2: Decimal → Binary
Convert each hex digit to 4 bits:
E = 1110
1 = 0001
7 = 0111
Binary = 111000010111
Step 3: Decimal → Octal
Divide:
3607 → 7027
Octal = 7027
✔ Final Answer:
Binary
Octal
Decimal
Hex
111000010111
7027
3607
E17
Easy2Siksha.com
Final Complete Table
Binary
Octal
Decimal
Hex
11001001
311
201
C9
1111011
173
123
7B
10001.01
21.2
17.25
11.4
111000010111
7027
3607
E17
Easy Way to Remember
Think of conversion like a bridge system:
• Binary ↔ Decimal → Use powers of 2
• Octal ↔ Binary → Group in 3 bits
• Hex ↔ Binary → Group in 4 bits
• Fractions → Multiply instead of divide
2.(a) Explain the importance of 2’s Complement scheme. Discuss giving an example.
(b) How negave numbers stored in the computer and why? Explain.
(c) Explain ASCII codes.
Ans: (a) Importance of 2’s Complement Scheme
When computers deal with numbers, they use binary (0s and 1s). Representing positive
numbers is easy, but representing negative numbers is tricky. That’s where the 2’s
complement scheme comes in.
Why is it important?
1. Simplifies Arithmetic With 2’s complement, addition and subtraction of signed
numbers can be done using the same binary addition rules. No separate circuits are
needed for positive and negative numbers.
2. Unique Zero Representation Unlike 1’s complement (which has +0 and –0), 2’s
complement has only one zero. This avoids confusion.
3. Efficient Hardware Design Computers can perform operations faster because the
same circuitry handles both positive and negative numbers.
Example
Let’s represent –5 in 8-bit binary using 2’s complement:
1. Write +5 in binary: 00000101
Easy2Siksha.com
2. Take 1’s complement (flip bits): 11111010
3. Add 1: 11111011
So, –5 = 11111011 in 2’s complement.
Now, if we add +5 (00000101) and –5 (11111011), the result is 00000000 (zero). This shows
how neatly arithmetic works in 2’s complement.
(b) How Negative Numbers Are Stored in Computers and Why
Computers store negative numbers using 2’s complement representation.
Why?
• It makes arithmetic operations simple.
• It avoids multiple representations of zero.
• It allows easy detection of overflow.
How?
1. Positive numbers are stored in normal binary.
2. Negative numbers are stored as the 2’s complement of their absolute value.
Example
Suppose we want to store –7 in 8 bits:
1. +7 = 00000111
2. Flip bits → 11111000
3. Add 1 → 11111001
So, –7 is stored as 11111001.
This way, the computer can handle both positive and negative numbers using the same
addition/subtraction logic.
(c) ASCII Codes
ASCII stands for American Standard Code for Information Interchange. It is a character
encoding scheme used by computers to represent text.
Importance
• Computers only understand numbers (binary). ASCII provides a way to map
characters (letters, digits, symbols) to numeric codes.
• It ensures consistency across devices and platforms.
How It Works
Easy2Siksha.com
• Each character is assigned a 7-bit (or 8-bit) binary code.
• Example:
o A = 65 (binary 01000001)
o a = 97 (binary 01100001)
o 0 = 48 (binary 00110000)
So when you type “Hello,” the computer stores it as: H = 72, e = 101, l = 108, l = 108, o = 111
Everyday Analogy
Think of ASCII as a dictionary. Instead of writing the word directly, you look up its number in
the dictionary. Computers use those numbers to understand and display text.
Diagram Explanation
Here’s a simple visualization:
Computer Representation
|
|---> 2’s Complement
| - Stores negative numbers
| - Simplifies arithmetic
|
|---> Storage of Negative Numbers
| - Uses 2’s complement
| - Example: -7 = 11111001
|
|---> ASCII Codes
- Maps characters to numbers
- Example: 'A' = 65, 'a' = 97
Relatable Story
Imagine you’re sending a text message. You type “Hi.” Your phone doesn’t actually store “H”
and “i” as letters—it stores them as ASCII codes (72 and 105). When your friend’s phone
receives the numbers, it translates them back into letters.
Meanwhile, if you’re doing math on your calculator app, it uses 2’s complement to handle
negative numbers. Without it, subtraction and negative values would be much harder to
process.
This shows how deeply these concepts are woven into everyday computing.
Key Takeaways
• 2’s Complement: The most efficient way to represent negative numbers in binary.
• Storage of Negative Numbers: Computers use 2’s complement because it simplifies
arithmetic and avoids confusion.
Easy2Siksha.com
• ASCII Codes: A universal system that maps characters to numeric codes, enabling
computers to handle text.
Conclusion
The 2’s complement scheme is crucial because it allows computers to represent negative
numbers efficiently and perform arithmetic seamlessly. Negative numbers are stored in
computers using this scheme to ensure simplicity and accuracy. Meanwhile, ASCII codes
bridge the gap between human language and machine language, enabling computers to
represent text consistently.
In short, 2’s complement makes math possible, and ASCII makes communication possible.
Together, they form the backbone of how computers process numbers and text, making
modern computing reliable and universal.
3.What is NAND gate? Why it is called universal gate? Explain the concept with examples.
Ans: 1. What is a NAND Gate?
A NAND gate is a basic digital logic gate used in electronics and computers. The name NAND
comes from two words:
NOT + AND = NAND
So, a NAND gate is simply the opposite of an AND gate.
How does it work?
• An AND gate gives output 1 (True) only when both inputs are 1
• A NAND gate does the opposite → it gives output 0 (False) only when both inputs
are 1
Truth Table of NAND Gate
Input A
Input B
Output (A NAND B)
0
0
1
0
1
1
1
0
1
1
1
0
So remember this simple rule:
“NAND gives 0 only when both inputs are 1, otherwise it gives 1.”
2. Diagram of NAND Gate
Easy2Siksha.com
Explanation of Diagram
• It looks like an AND gate but with a small circle (bubble) at the output.
• That small circle represents NOT (inversion).
• So it means:
First AND → then NOT
3. Why is NAND Called a Universal Gate?
Now comes the most important part of your question.
A NAND gate is called a Universal Gate because:
We can create all other logic gates (AND, OR, NOT, NOR, XOR, etc.) using only NAND
gates.
Easy2Siksha.com
In simple words:
If you only have NAND gates, you can build an entire digital circuit—even a computer!
4. Understanding with Simple Examples
Let’s see how NAND can create other gates.
(A) NOT Gate using NAND
If we connect both inputs of a NAND gate together:
A ─┬──
│
NAND → Output = NOT A
A ─┘
Output becomes the opposite of input.
A
Output
0
1
1
0
✔ So, NAND can act as a NOT gate
(B) AND Gate using NAND
We know:
• NAND = NOT (AND)
So if we invert the output of NAND, we get AND.
Use two NAND gates:
1. First NAND → gives NAND output
2. Second NAND (as NOT) → converts it back to AND
✔ Result: AND gate
Easy2Siksha.com
(C) OR Gate using NAND
This is a bit tricky but simple if you follow:
Using De Morgan’s Law:
A OR B = NOT (NOT A AND NOT B)
So:
1. First convert A → NOT A (using NAND)
2. Convert B → NOT B (using NAND)
3. Then apply NAND again
✔ Result: OR gate
5. Visual Representation of NAND as Universal Gate
6. Real-Life Understanding (Easy Analogy)
Think of NAND gate like a 万能 tool (multi-purpose tool)
Easy2Siksha.com
• Imagine you only have one tool, but you can still:
o Cut (NOT)
o Join (AND)
o Choose (OR)
That’s why NAND is called universal
Because it can do everything by itself
7. Why is NAND Important?
• Used in computers, calculators, and digital circuits
• Easy to manufacture in hardware
• More efficient and cost-effective
• Forms the foundation of digital electronics
8. Final Summary
✔ NAND = NOT + AND
✔ Output is 0 only when both inputs are 1
✔ It has a small circle (NOT) at output
✔ Called Universal Gate because:
It can create all other logic gates
Conclusion
A NAND gate is like a smart building block of electronics. Even though it is just one type of
gate, it is powerful enough to build every other logic operation. That’s why engineers love it
and call it the Universal Gate.
4.What is K-map? How it is helpful in solving Boolean expressions? Discuss in detail using
suitable example.
Ans: What Is a K-map?
A Karnaugh Map (K-map) is a graphical method used in digital electronics to simplify
Boolean expressions. Boolean expressions describe how logic circuits behave, but they can
often be complicated. The K-map provides a visual way to minimize these expressions,
reducing the number of logic gates needed in a circuit.
Easy2Siksha.com
Think of it as a puzzle board: instead of solving Boolean algebra step by step, you place
values on a grid and group them visually. It’s faster, easier, and less error-prone.
Everyday Analogy
Imagine you’re cleaning your room. You could pick up each item one by one and think about
where it belongs—that’s like solving Boolean algebra with formulas. Or you could group
similar items together—books in one pile, clothes in another—and organize them faster.
That’s what a K-map does: it groups similar terms to simplify the whole expression.
Structure of a K-map
• A K-map is a grid.
• The size depends on the number of variables:
o 2 variables → 2×2 grid (4 cells).
o 3 variables → 2×4 grid (8 cells).
o 4 variables → 4×4 grid (16 cells).
• Each cell represents a minterm (a combination of variables).
• The arrangement is special: adjacent cells differ by only one variable (Gray Code).
This adjacency allows grouping.
Why Do We Use K-maps?
• To simplify Boolean expressions.
• To reduce the number of logic gates in a circuit.
• To make designs more efficient (less cost, less power).
• To avoid mistakes compared to algebraic simplification.
Example: Simplifying a Boolean Expression
Let’s take a Boolean function of three variables: F(A, B, C) = Σ(1, 2, 3, 5, 7)
This means the function is true for minterms 1, 2, 3, 5, and 7.
Step 1: Draw the K-map
For 3 variables (A, B, C), we use a 2×4 grid.
BC
00 01 11 10
A=0 F1 F2 F3 F?
A=1 F? F5 F7 F?
Step 2: Fill the K-map
• Place 1 in cells corresponding to minterms (1, 2, 3, 5, 7).
• Place 0 in others.
Easy2Siksha.com
Step 3: Grouping
Group adjacent 1s in rectangles of size 2, 4, or 8. Each group represents a simplified term.
Here, we can form:
• Group (1, 3) → A’B
• Group (2, 3) → A’C
• Group (5, 7) → AC
Step 4: Simplified Expression
So, F(A, B, C) = A’B + A’C + AC
This is much simpler than writing all minterms individually.
Diagram Explanation
Here’s a simple visualization:
K-map Grid
|
|---> Fill with 1s (true minterms)
|---> Group adjacent 1s
|---> Write simplified expression
Relatable Story
Imagine you’re designing a traffic light controller. The Boolean expression for when the
green light should turn on is very complex. If you implement it directly, you’ll need many
logic gates, making the circuit bulky and costly. But if you use a K-map to simplify the
expression, you reduce the number of gates, saving money and power. That’s why engineers
love K-maps—they make life easier.
Practice Exercise
Try this: Simplify F(A, B, C, D) = Σ(0, 2, 5, 7, 8, 10, 13, 15) using a 4-variable K-map.
• Draw a 4×4 grid.
• Fill in the minterms.
• Group adjacent 1s.
• Write the simplified expression.
This exercise will help you see how grouping works in larger maps.
Benefits of K-maps
• Easy visualization.
Easy2Siksha.com
• Reduces complex expressions quickly.
• Saves hardware cost and power.
• Avoids algebraic mistakes.
• Works well for up to 5–6 variables.
Conclusion
A K-map is a powerful tool for simplifying Boolean expressions in digital electronics. It
organizes minterms into a grid, allowing easy grouping. By grouping adjacent 1s, we derive a
simpler expression that requires fewer logic gates. This makes circuits more efficient,
cheaper, and reliable.
In short, K-maps are like shortcuts in logic design. They transform complex Boolean puzzles
into simple, elegant solutions, making them indispensable for engineers and students alike.
5.What is the need of a Decoder? Make a 3-8 Decoder using two 2-4 Decoders.
Ans: 1. What is a Decoder?
Imagine you have a secret code system . You press some buttons (inputs), and only one
specific light turns ON (output). That’s exactly what a decoder does.
A decoder is a digital circuit that:
• Takes binary input (like 00, 01, 10, 11)
• Converts it into one specific output line
• Only one output is active at a time
Example:
If you give input 2 bits, you get 4 outputs
If you give input 3 bits, you get 8 outputs
General Rule:
inputs
outputs
2. Why Do We Need a Decoder?
Now you may ask—why do we even need this?
Think of real-life situations:
Easy2Siksha.com
1. Memory Selection (Computers)
In computers, many memory locations exist.
Decoder helps select one specific memory location.
Example:
• You want to access location 101 → Decoder activates only that line
2. Display Systems
Used in:
• LED displays
• Digital clocks
• 7-segment displays
Decoder converts binary data into signals to show numbers.
3. Control Systems
In circuits, we often need to:
• Turn ON only one device at a time
• Control machines automatically
Decoder ensures only one output works at a time, avoiding confusion.
4. Communication Systems
Used in:
• Data transmission
• Address decoding in networks
In simple words:
A decoder helps us choose one thing from many options using binary input.
Easy2Siksha.com
3. What is a 2-to-4 Decoder?
Before building a 3-to-8 decoder, we must understand a 2-to-4 decoder.
It has:
• 2 inputs (A, B)
• 4 outputs (Y0, Y1, Y2, Y3)
Truth Table:
A
B
Active Output
0
0
Y0
0
1
Y1
1
0
Y2
1
1
Y3
Diagram (2-to-4 Decoder)
Easy2Siksha.com
Only one output becomes HIGH (1) depending on input.
4. What is a 3-to-8 Decoder?
It has:
• 3 inputs (A, B, C)
• 8 outputs (Y0 to Y7)
Only one output is active based on the 3-bit input.
5. How to Make a 3-to-8 Decoder Using Two 2-to-4 Decoders
Now comes the main part
We will build a 3-to-8 decoder using two 2-to-4 decoders
Step-by-Step Idea
We have 3 inputs:
• A (MSB – Most Significant Bit)
• B
• C
Trick:
• Use A as control (Enable)
• Use B and C as inputs for both decoders
Components Needed:
• Two 2-to-4 decoders
• Each decoder must have an Enable (E) input
Working Concept
Easy2Siksha.com
Step 1:
• Connect B and C to both decoders
Step 2:
• Use A to control which decoder works
First Decoder:
• Enable = A' (NOT A)
• Works when A = 0
Second Decoder:
• Enable = A
• Works when A = 1
Logic Behind It
When A = 0:
• First decoder is active
• Outputs: Y0, Y1, Y2, Y3
When A = 1:
• Second decoder is active
• Outputs: Y4, Y5, Y6, Y7
Output Mapping
A
B
C
Output
0
0
0
Y0
0
0
1
Y1
0
1
0
Y2
0
1
1
Y3
1
0
0
Y4
1
0
1
Y5
1
1
0
Y6
1
1
1
Y7
Easy2Siksha.com
6. Diagram of 3-to-8 Decoder Using Two 2-to-4 Decoders
4
7. Easy Way to Remember
Easy2Siksha.com
Think like this:
• A decides which decoder to use
• B and C decide which output inside that decoder
Analogy:
Imagine a building with 2 floors:
• Floor 0 → First decoder
• Floor 1 → Second decoder
A decides the floor
B and C decide the room
So:
• A = 0 → Go to floor 0 → pick room (Y0–Y3)
• A = 1 → Go to floor 1 → pick room (Y4–Y7)
8. Final Conclusion
• A decoder converts binary input into a unique output.
• It is widely used in computers, memory, and digital systems.
• A 3-to-8 decoder can be easily built using two 2-to-4 decoders by:
o Using one input as enable control
o Sharing remaining inputs
In one line:
A decoder helps us select one output from many using binary input, and complex decoders
can be built using smaller ones.
Easy2Siksha.com
6.(a) What is a combinaonal circuit? Make a 4-bit adder-subtracter circuit.
(b) What is the limitaon of J-K ip op? How is it solved? Explain.
(c) Draw and explain the structure of a 4-bit binary counter with increment input.
Ans: (a) Combinational Circuit and 4-bit Adder-Subtracter
What is a Combinational Circuit?
A combinational circuit is a type of digital circuit where the output depends only on the
present inputs, not on past inputs. In other words, it has no memory.
Examples: adders, subtracters, multiplexers, encoders, decoders.
Key Features:
• Output is a direct function of input.
• No feedback loops.
• Faster and simpler compared to sequential circuits.
4-bit Adder-Subtracter Circuit
A 4-bit adder-subtracter is a combinational circuit that can perform both addition and
subtraction on two 4-bit binary numbers.
Working Principle:
• Addition is straightforward using a binary adder.
• Subtraction is performed using the 2’s complement method.
• To subtract B from A, we add A with the 2’s complement of B.
Circuit Design:
1. Use a 4-bit full adder.
2. Connect the second input (B) through XOR gates controlled by a mode signal (M).
o If M = 0 → perform addition (B unchanged).
o If M = 1 → perform subtraction (B inverted, plus 1 added through carry-in).
Diagram (Conceptual)
Adder-Subtracter Circuit
Inputs: A (4-bit), B (4-bit), Mode (M)
|
|---> XOR gates (control B based on M)
|
|---> 4-bit Full Adder
|
Output: Sum/Difference (4-bit), Carry/Borrow
Easy2Siksha.com
So, with one circuit, we can perform both addition and subtraction.
(b) Limitation of J-K Flip Flop and Its Solution
J-K Flip Flop
The J-K flip flop is a versatile sequential circuit. It has two inputs (J and K), a clock, and
outputs Q and Q’.
Truth Table (simplified):
• J=0, K=0 → No change.
• J=0, K=1 → Reset (Q=0).
• J=1, K=0 → Set (Q=1).
• J=1, K=1 → Toggle (Q changes state).
Limitation: The “Race Around” Problem
When J=K=1 and the clock pulse is high for a long duration, the output toggles continuously.
This is called the race around condition.
It happens because the flip flop keeps changing state as long as the clock is active, leading to
unpredictable results.
Solution
The race around problem is solved by using a Master-Slave J-K Flip Flop or by using edge-
triggered flip flops.
Master-Slave J-K Flip Flop:
• Consists of two J-K flip flops connected in series.
• The first (master) responds to the clock pulse.
• The second (slave) responds to the inverted clock.
• This ensures that the output changes only once per clock cycle, eliminating race
around.
Edge-Triggered Flip Flop:
• Output changes only at the rising or falling edge of the clock, not during the entire
pulse.
• This prevents continuous toggling.
Diagram (Conceptual)
Master-Slave J-K Flip Flop
|
|---> Master (active on clock high)
Easy2Siksha.com
|---> Slave (active on clock low)
|
Output: Stable, no race around
(c) 4-bit Binary Counter with Increment Input
What is a Binary Counter?
A binary counter is a sequential circuit that counts in binary. It increments its value with
each clock pulse.
A 4-bit counter can count from 0000 (0) to 1111 (15).
Structure of 4-bit Binary Counter
• Consists of 4 flip flops (usually T flip flops or J-K flip flops).
• Each flip flop represents one bit.
• The output of one flip flop acts as the clock for the next (in ripple counters).
Increment Input
An increment input allows the counter to increase its value by 1 when activated.
Working:
• If Increment = 1 → counter increases with each clock pulse.
• If Increment = 0 → counter holds its value.
Diagram (Conceptual)
4-bit Binary Counter with Increment
Inputs: Clock, Increment
|
|---> Control logic (checks Increment)
|
|---> 4 Flip Flops (Q0, Q1, Q2, Q3)
|
Output: 4-bit binary count (0000 to 1111)
Example Operation
• Initial state: 0000
• Increment = 1, Clock pulse → 0001
• Next pulse → 0010
• Next pulse → 0011 ... continues up to 1111, then rolls back to 0000.
Relatable Story
Easy2Siksha.com
Imagine a digital stopwatch.
• The adder-subtracter is like the part that calculates time differences.
• The J-K flip flop ensures the stopwatch runs smoothly without glitches.
• The binary counter is the part that counts seconds in binary form.
Together, these circuits make digital devices reliable and efficient.
Key Takeaways
• Combinational circuits produce outputs based only on current inputs. A 4-bit adder-
subtracter is a prime example.
• J-K flip flop is versatile but suffers from race around, solved by master-slave or edge-
triggered designs.
• Binary counters use flip flops to count in binary, and an increment input allows
controlled counting.
Conclusion
Digital electronics relies on both combinational and sequential circuits. The 4-bit adder-
subtracter shows how combinational logic can perform arithmetic efficiently. The J-K flip
flop highlights the challenges of sequential circuits and how clever designs solve them.
Finally, the 4-bit binary counter with increment input demonstrates how sequential circuits
keep track of events in binary form.
In short, these circuits are the backbone of digital systems—from calculators and computers
to timers and controllers. Understanding them gives us insight into how machines think,
calculate, and keep track of time.
7.What is ROM? Explain dierent types of ROM memory in detail.
Ans: What is ROM? (Read Only Memory)
Easy2Siksha.com
Imagine your computer or mobile phone as a human being. Just like we have permanent
memories (like our name, basic habits, or how to speak), computers also need some
permanent instructions to start working. These instructions are stored in something called
ROM (Read Only Memory).
Simple Definition:
ROM (Read Only Memory) is a type of memory in a computer that stores permanent data
or instructions. These instructions are not lost when the power is turned off.
So, even when your device is switched off, ROM remembers everything stored in it.
Why is ROM Important?
Think about what happens when you turn on your computer or mobile:
• It starts automatically
• The system loads basic instructions
• Hardware gets checked
All this is possible because of ROM.
Key Functions:
• Stores booting instructions (startup process)
• Contains firmware (basic software embedded in hardware)
• Helps in initializing hardware devices
Without ROM, your computer would not even know how to start!
Easy2Siksha.com
ROM vs RAM (Quick Understanding)
Feature
ROM
RAM
Full Form
Read Only Memory
Random Access Memory
Data Nature
Permanent
Temporary
Power Supply
Not required to retain data
Required
Usage
Stores startup instructions
Stores running programs
In simple words:
• ROM = Permanent memory
• RAM = Temporary memory
Types of ROM Memory
Now let’s understand the different types of ROM in a simple and interesting way.
MROM (Masked Read Only Memory)
What is MROM?
MROM is the original form of ROM. It is programmed at the time of manufacturing.
Key Features:
Easy2Siksha.com
• Data is permanently written by the manufacturer
• Cannot be changed or modified
• Very cheap when produced in bulk
Example:
Used in devices like calculators, washing machines, and simple electronic gadgets.
Simple Analogy:
Think of it like a printed book — once printed, you cannot change the content.
PROM (Programmable Read Only Memory)
Easy2Siksha.com
What is PROM?
PROM is a type of ROM that is empty initially and can be programmed once by the user.
Key Features:
• Can be programmed only one time
• After programming, data becomes permanent
• Uses special device called a PROM programmer
Example:
Used in embedded systems where data is written once and never changed.
Simple Analogy:
Like writing with a permanent marker — once written, you cannot erase it.
EPROM (Erasable Programmable Read Only Memory)
Easy2Siksha.com
What is EPROM?
EPROM can be erased and reprogrammed multiple times using ultraviolet (UV) light.
Key Features:
• Data can be erased using UV light
• Chip must be removed from the computer
• Reusable but not very convenient
Example:
Used in older computers and development systems.
Simple Analogy:
Like a whiteboard, but you need a special light (UV) to erase it instead of a duster.
EEPROM (Electrically Erasable Programmable Read Only Memory)
Easy2Siksha.com
What is EEPROM?
EEPROM is an advanced version of EPROM that can be erased and reprogrammed using
electricity.
Key Features:
• No need to remove the chip
• Can be erased byte by byte
• More flexible and widely used
Example:
Used in BIOS, microcontrollers, and modern electronic devices.
Simple Analogy:
Like editing a Word document — you can easily change small parts whenever needed.
Flash Memory (Modern ROM)
Easy2Siksha.com
4
What is Flash Memory?
Flash memory is a type of EEPROM but faster and more efficient. It is widely used in modern
devices.
Key Features:
Easy2Siksha.com
• Data erased in blocks (not byte-by-byte)
• Faster and more durable
• Used in USB drives, SSDs, smartphones
Example:
• Pen drives
• Memory cards
• SSD storage
Simple Analogy:
Like deleting or editing entire folders instead of individual files.
Summary (Easy Revision)
• ROM is permanent memory used to store important instructions
• It helps the computer start and function properly
• Types of ROM:
o MROM → Fixed at manufacturing
o PROM → Programmable once
o EPROM → Erased by UV light
o EEPROM → Electrically erasable
o Flash Memory → Modern, fast, widely used
Final Understanding
Think of ROM as the “soul” or “basic instinct” of a computer. It tells the system:
“How to start, what to do first, and how to control basic operations.”
Without ROM, your device would be like a human without basic instincts — it simply
wouldn’t function.
8.What is Address Selecon Logic? Explain the Address Selecon Logic in Random Access
Memory in detail using a suitable example.
Ans: What is Address Selecon Logic?
In digital systems, especially in memory units, address selecon logic is the mechanism that
decides which memory locaon should be accessed at a given me.
Easy2Siksha.com
Think of memory as a huge library with thousands of books (data). To read or write a specic
book, you need its shelf number (address). The address selecon logic acts like the
librarian—it takes the address you provide and points directly to the correct shelf, ensuring
you get the right book without confusion.
Everyday Analogy
Imagine you are in a hostel with 100 rooms. Each room has a unique number. If you want to
deliver a leer to a student, you must know the room number. The hostel warden (address
selecon logic) checks the number and directs you to the exact room. Similarly, in memory,
the address selecon logic ensures that the CPU accesses the correct memory cell.
Address Selecon Logic in Random Access Memory (RAM)
Random Access Memory (RAM) is a type of memory where any locaon can be accessed
directly if you know its address. Unlike sequenal memory (like tapes), RAM allows quick
access.
The address selecon logic in RAM ensures that when the CPU provides an address, only
the corresponding memory cell is acvated for reading or wring.
Structure of RAM
RAM consists of:
1. Memory Cells – Each cell stores 1 bit (0 or 1).
2. Address Lines – Wires that carry the address from the CPU.
3. Data Lines – Wires that carry the actual data (input or output).
4. Control Lines – Signals like Read/Write and Chip Enable.
5. Address Decoder – The heart of address selecon logic.
How Address Selecon Logic Works
1. The CPU sends an address through the address bus.
2. The address decoder interprets this binary address.
3. The decoder acvates exactly one memory cell (or word line) corresponding to that
address.
4. Depending on the control signal:
o If Read → data from that cell is sent to the CPU.
o If Write → new data is stored in that cell.
Example: 4×4 RAM
Easy2Siksha.com
Let’s take a small RAM with 16 cells (4 rows × 4 columns).
• To access 16 cells, we need 4 address lines (because 2⁴ = 16).
• Suppose the CPU sends the address 1010 (binary for 10).
• The address decoder acvates cell number 10.
• If Read = 1, the data stored in cell 10 is sent to the CPU.
• If Write = 1, new data is stored in cell 10.
Diagram Explanaon (Conceptual)
CPU ----> Address Bus ----> Address Decoder ----> Selected
Memory Cell
| |
|----> Control Lines |
|----> Data Bus <------|
The decoder ensures that only one memory cell is acve at a me, prevenng errors.
Detailed Example: Address Selecon in 8×8 RAM
Suppose we have RAM with 64 cells (8 rows × 8 columns).
• Total cells = 64 → requires 6 address lines (since 2⁶ = 64).
• Address lines are divided into row address and column address.
• For example, address 001011 (binary for 11) points to row 3, column 3.
• The decoder acvates that exact cell.
This method ensures precise selecon among thousands of cells.
Relatable Story
Imagine a school exam hall with 64 seats. Each student has a roll number. When the
invigilator calls roll number 11, only the student in seat 11 responds. That’s how address
selecon logic works—it ensures only the correct memory cell responds to the CPU’s call.
Importance of Address Selecon Logic
• Accuracy: Ensures the CPU reads/writes the correct cell.
• Speed: Enables quick access to any memory locaon.
• Eciency: Prevents mulple cells from responding at once.
• Scalability: Works even when memory size increases (e.g., from 64 cells to millions).
Easy2Siksha.com
Pracce Reecon
Try this:
• Imagine RAM with 1024 cells. How many address lines are needed?
• Answer: 10 lines (since 2¹⁰ = 1024).
This shows how address selecon logic scales with memory size.
Advanced Note: Row and Column Decoding
In large RAM chips, addresses are split into row address and column address.
• First, the row decoder selects a row.
• Then, the column decoder selects a column.
• Together, they pinpoint the exact cell.
This reduces the number of wires needed and makes design praccal.
Conclusion
Address selecon logic is the mechanism that allows the CPU to access the correct memory
cell in RAM. It uses address lines and decoders to acvate only one cell at a me. This
ensures accuracy, speed, and eciency in memory operaons.
In short, address selecon logic is like the librarian of the computer’s memory—it ensures
that when the CPU asks for a specic book (data), the right one is delivered instantly.
Without it, memory access would be chaoc and unreliable.
“This paper has been carefully prepared for educaonal purposes. If you noce any
mistakes or have suggesons, feel free to share your feedback.”
